Some Results on Generalized Degree Distance
نویسندگان
چکیده
منابع مشابه
Some Results on Generalized Degree Distance
In [1], Hamzeh, Iranmanesh Hossein-Zadeh and M. V. Diudea recently introduced the generalized degree distance of graphs. In this paper, we present explicit formulas for this new graph invariant of the Cartesian product, composition, join, disjunction and symmetric difference of graphs and introduce generalized and modified generalized degree distance polynomials of graphs, such that their first...
متن کاملSome results on the reciprocal sum-degree distance of graphs
In this contribution, we first investigate sharp bounds for the reciprocal sum-degree distance of graphs with a given matching number. The corresponding extremal graphs are characterized completely. Then we explore the k-decomposition for the reciprocal sum-degree distance. Finally,we establish formulas for the reciprocal sum-degree distance of join and the Cartesian product of graphs.
متن کاملGeneralized Degree Distance of Strong Product of Graphs
In this paper, the exact formulae for the generalized degree distance, degree distance and reciprocal degree distance of strong product of a connected and the complete multipartite graph with partite sets of sizes m0, m1, . . . , mr&minus1 are obtained. Using the results obtained here, the formulae for the degree distance and reciprocal degree distance of the closed and open fence graphs are co...
متن کاملSome Results on a Generalized Archimedean Family of Copulas
Durante et al. (2007) introduced a class of bivariate copulas depending on two generators which generalizes some known families such as the Archimedean copulas. In this paper we provide some result on properties of this family when the generators are certain univariate survival functions.
متن کاملSome results on generalized exponents
A digraph G = (V; E) is primitive if, for some positive integer k, there is a u ! v walk of length k for every pair u; v of vertices of V. The minimum such k is called the exponent of G, denoted exp(G). The exponent of a vertex u 2 V , denoted exp(u), is the least integer k such that there is a u ! v walk of length k for each v 2 V. For a set X V , exp(X) is the least integer k such that for ea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Journal of Discrete Mathematics
سال: 2013
ISSN: 2161-7635,2161-7643
DOI: 10.4236/ojdm.2013.33026